Splitting and Jump Inversion in the Turing Degrees

نویسندگان

  • S. BARRY COOPER
  • ANGSHENG LI
  • BARRY COOPER
  • MINGJI XIA
چکیده

It is shown that for any computably enumerable degree a 6= 0, any degree c 6= 0, and any Turing degree s, if s ≥ 0, and c.e. in a, then there exists a c.e. degree x with the following properties, (1) x < a, c 6≤ x, (2) a is splittable over x, and (3) x = s. This implies that the Sacks’ splitting theorem and the Sacks’ jump theorem can be uniformly combined. A corollary is that there is no atomic jump class consisting entirely of Harrington non-splitting bases.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Bounded Jump for the Bounded Turing Degrees

We define the bounded jump of A by A = {x ∈ ω | ∃i ≤ x[φi(x) ↓ ∧ Φ φi(x) x (x)↓]} and let A denote the n-th bounded jump. We demonstrate several properties of the bounded jump, including that it is strictly increasing and order preserving on the bounded Turing (bT ) degrees (also known as the weak truth-table degrees). We show that the bounded jump is related to the Ershov hierarchy. Indeed, fo...

متن کامل

Antibasis theorems for Π1 classes and the jump hierarchy

We prove two antibasis theorems for Π1 classes. The first is a jump inversion theorem for Π1 classes with respect to the global structure of the Turing degrees. For any P ⊆ 2, define S(P ), the degree spectrum of P , to be the set of all Turing degrees a such that there exists A ∈ P of degree a. For any degree a ≥ 0, let Jump(a) = {b : b = a}. We prove that, for any a ≥ 0 and any Π1 class P , i...

متن کامل

A Total Degree Splitting Theorem and a Jump Inversion Splitting Theorem

We propose a meta-theorem from which some splitting theorem for total e-degrees can be derived.

متن کامل

Some improvements in fuzzy turing machines

In this paper, we improve some previous definitions of fuzzy-type Turing machines to obtain degrees of accepting and rejecting in a computational manner. We apply a BFS-based search method and some level’s upper bounds to propose a computational process in calculating degrees of accepting and rejecting. Next, we introduce the class of Extended Fuzzy Turing Machines equipped with indeterminacy s...

متن کامل

A Basis Theorem for Π1 Classes of Positive Measure and Jump Inversion for Random Reals

We extend the Shoenfield jump inversion theorem to the members of any Π1 class P ⊆ 2 with nonzero measure; i.e., for every Σ2 set S ≥T ∅′, there is a ∆2 real A ∈ P such that A′ ≡T S. In particular, we get jump inversion for ∆2 1-random reals. 1 This paper is part of an ongoing program to study the relationship between two fundamental notions of complexity for real numbers. The first is the comp...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2008